396 research outputs found
The Fixed Point Property for Posets of Small Width
The fixed point property for finite posets of width 3 and 4 is studied in
terms of forbidden retracts. The ranked forbidden retracts for width 3 and 4
are determined explicitly. The ranked forbidden retracts for the width 3 case
that are linearly indecomposable are examined to see which are minimal
automorphic. Part of a problem of Niederle from 1989 is thus solved
Chain Decomposition Theorems for Ordered Sets (and Other Musings)
A brief introduction to the theory of ordered sets and lattice theory is
given. To illustrate proof techniques in the theory of ordered sets, a
generalization of a conjecture of Daykin and Daykin, concerning the structure
of posets that can be partitioned into chains in a ``strong'' way, is proved.
The result is motivated by a conjecture of Graham's concerning probability
correlation inequalities for linear extensions of finite posets
A structure theorem for posets admitting a “strong” chain partition: A generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities)
AbstractSuppose a finite poset P is partitioned into three non-empty chains so that, whenever p, q∈P lie in distinct chains and p<q, then every other element of P is either above p or below q.In 1985, the following conjecture was made by David Daykin and Jacqueline Daykin: such a poset may be decomposed into an ordinal sum of posets ⊕i=1nRi such that, for 1⩽i⩽n, one of the following occurs:(1)Ri is disjoint from one of the chains of the partition; or(2)if p, q∈Ri are in distinct chains, then they are incomparable.The conjecture is related to a question of R. L. Graham's concerning probability correlation inequalities for linear extensions of finite posets.In 1996, a proof of the Daykin–Daykin conjecture was announced (by two other mathematicians), but their proof needs to be rectified.In this note, a generalization of the conjecture is proven that applies to finite or infinite posets partitioned into a (possibly infinite) number of chains with the same property. In particular, it is shown that a poset admits such a partition if and only if it is an ordinal sum of posets, each of which is either a width 2 poset or else a disjoint sum of chains. A forbidden subposet characterization of these partial orders is also obtained
Posets That Locally Resemble Distributive Lattices An Extension of Stanley's Theorem (with Connections to Buildings and Diagram Geometries)
AbstractLet P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a distributive lattice and that, for every interval of rank at least 4, the interval minus its endpoints is connected. It is shown that P is a distributive lattice, thus resolving an issue raised by Stanley. Similar theorems are proven for semimodular, modular, and complemented modular lattices. As a corollary, a theorem of Stanley for Boolean lattices is obtained, as well as a theorem of Grabiner (conjectured by Stanley) for products of chains. Applications to incidence geometry and connections with the theory of buildings are discussed
- …